<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    539. Minimum Time Difference
   </h1>
   Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum
   <b>
    minutes
   </b>
   difference between any two time points in the list.
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> ["23:59","00:00"]
<b>Output:</b> 1
</pre>
   <p>
    <b>
     Note:
    </b>
    <br>
   </p>
   <ol>
    <li>
     The number of time points in the given list is at least 2 and won't exceed 20000.
    </li>
    <li>
     The input time is legal and ranges from 00:00 to 23:59.
    </li>
   </ol>
  </div>
  <div>
   <h1 class="question_title">
    539. 最小时间差
   </h1>
   <p>
    给定一个 24 小时制（小时:分钟）的时间列表，找出列表中任意两个时间的最小时间差并已分钟数表示。
   </p>
   <p>
    <br>
    <strong>
     示例 1：
    </strong>
   </p>
   <pre>
<strong>输入:</strong> ["23:59","00:00"]
<strong>输出:</strong> 1
</pre>
   <p>
    <br>
    <strong>
     备注:
    </strong>
   </p>
   <ol>
    <li>
     列表中时间数在 2~20000 之间。
    </li>
    <li>
     每个时间取值在 00:00~23:59 之间。
    </li>
   </ol>
  </div>
 </body>
</html>